The modular n-queen problem II

A New Approach to Solve N-Queen Problem with Parallel Genetic Algorithm

Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...

Solving N Queen Problem Using Various Algorithms – A Survey

Combinatorial optimization problems form a set of problems which need a considerable effort and time to be solved. Their difficulty lies in the fact that there is no formula for solving them exactly. Every possibility has to be examined in order to find the best solution and the number of possibilities increases exponentially as the size of the problem increases. In this paper we discussed abou...

A DNA Sticker Algorithm for Solving N-Queen Problem

Over the past few decades numerous attempts have been made to solve combinatorial optimization problems that are NP-complete or NP -hard. It has been evidenced that DNA computing can solve those problems which are currently intractable on even fastest electronic computers. This paper proposes a new DNA algorithm for solving N-Queen problem, a complex optimization problem. The algorithm not only...

The N-Membranes Problem

Queen Elizabeth II Fellows

he electrochemical control of oxidation and reduction processes in organic and inorganic systems is an area of extensive research in both academia and industry. Electrochemical techniques are extremely useful in generating interesting species in unusual oxidation states, or for producing reactive intermediates (as, for example in the reductive dimerization of vinyl cyanide in the Monsanto manuf...